The Jacobian Determinant of the Conductivities-to-response-matrix Map for Well-connected Critical Circular Planar Graphs
نویسندگان
چکیده
We consider the map from conductivities to the response matrix. For critical circular planar graphs, this map is known to be invertible, at least when the conductivities are positive. We calculate the Jacobian determinant of this map, which turns out to have a fairly simple form. Using this we show that for arbitrary critical circular planar networks, the map from conductivities to the response matrix is generally invertible when the conductivities are allowed to be negative or complex (but nonzero). This is an alternate proof to a result in [4].
منابع مشابه
Circular planar graphs and resistor networks
We consider circular planar graphs and circular planar resistor networks. Associated with each circular planar graph F there is a set n(F) = { (P; Q) } of pairs of sequences of boundary nodes which are connected through F. A graph F is called critical if removing any edge breaks at least one of the connections (P: Q) in n(F). We prove that two critical circular planar graphs are Y-A equivalent ...
متن کاملRecovery of Non-linear Conductivities for Circular Planar Graphs
We consider the problem of recovering nonlinear conductances in a circular planar graph. If the graph is critical (in the sense of [2]), and the conductance functions satisfy some weak conditions (such as being bijective), we show that the conductance functions are completely recoverable from the Dirichlet-to-Neumann relationship. This result is general enough that it also demonstrates the reco...
متن کاملIrreducibility properties of Keller maps
J ‘ edrzejewicz showed that a polynomial map over a field of characteristic zero is invertible, if and only if the corresponding endomorphism maps irreducible polynomials to irreducible polynomials. Furthermore, he showed that a polynomial map over a field of characteristic zero is a Keller map, if and only if the corresponding endomorphism maps irreducible polynomials to square-free polynomial...
متن کاملUsing the Matrix Method to Compute the Degrees of Freedom of Mechanisms
In this paper, some definitions and traditional formulas for calculating the mobility of mechanisms are represented, e.g. Grubler formula, Somov - Malyshev formula, and Buchsbaum - Freudenstei. It is discussed that there are certain cases in which they are too ambiguous and incorrect to use. However, a matrix method is suggested based on the rank of the Jacobian of the mechanism and its applica...
متن کاملNovel Relationships Between Circular Planar Graphs and Electrical Networks
Circular planar graphs are used to model electrical networks, which arise in classical physics. Associated with such a network is a network response matrix, which carries information about how the network behaves in response to certain potential differences. Circular planar graphs can be organized into equivalence classes based upon these response matrices. In each equivalence class, certain fu...
متن کامل